An O(T log T) reduction from RAM computations to satisfiability
نویسندگان
چکیده
منابع مشابه
Delegating RAM Computations
In the setting of cloud computing a user wishes to delegate its data, as well as computations over this data, to a cloud provider. Each computation may read and modify the data, and these modifications should persist between computations. Minding the computational resources of the cloud, delegated computations are modeled as RAM programs. In particular, the delegated computations’ running time ...
متن کاملFrom RAM to SAT
Common presentations of the NP-completeness of SAT suffer from two drawbacks which hinder the scope of this flagship result. First, they do not apply to machines equipped with random-access memory, also known as direct-access memory, even though this feature is critical in basic algorithms. Second, they incur a quadratic blow-up in parameters, even though the distinction between, say, linear an...
متن کاملFrom Propositional Satisfiability to Satisfiability Modulo Theories
In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems. As applied to different system verification problems, SMT problems comprise of different theories including fragments of elementary theory of num...
متن کاملlogcondens: Computations Related to Univariate Log-Concave Density Estimation
Maximum likelihood estimation of a log-concave density has attracted considerable attention over the last few years. Several algorithms have been proposed to estimate such a density. Two of those algorithms, an iterative convex minorant and an active set algorithm, are implemented in the R package logcondens. While these algorithms are discussed elsewhere, we describe in this paper the use of t...
متن کاملThe Reduction of Satisfiability Problems into 2CNF Satisfiability Problems
Many search techniques are successful in finding solutions to NP-Complete problems in polynomial-time. The search time can be improved upon by sub-dividing the variables and clauses. This sub-division generates data pairs in conjunctive normal form. Then, by using the Two-SAT algorithm, the new subset of data is solved in linear-time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90177-4